Some constructions for real algebraic curves
نویسندگان
چکیده
منابع مشابه
Some Algebraic Definitions and Constructions
Definition 1. A monoid is a set M with an element e and an associative multiplication M×M −→ M for which e is a two-sided identity element: em = m = me for all m ∈ M . A group is a monoid in which each element m has an inverse element m, so that mm = e = mm. A homomorphism f : M −→ N of monoids is a function f such that f(mn) = f(m)f(n) and f(eM ) = eN . A “homomorphism” of any kind of algebrai...
متن کاملReal Plane Algebraic Curves
We study real algebraic plane curves, at an elementary level, using as little algebra as possible. Both cases, affine and projective, are addressed. A real curve is infinite, finite or empty according to the fact that a minimal polynomial for the curve is indefinite, semi–definite nondefinite or definite. We present a discussion about isolated points. By means of the operator, these points can ...
متن کاملClifford Theorem for real algebraic curves
In this note, a real algebraic curve X is a smooth proper geometrically integral scheme over R of dimension 1. A closed point P of X will be called a real point if the residue field at P is R, and a non-real point if the residue field at P is C. The set of real points, X(R), will always be assumed to be non empty. It decomposes into finitely many connected components, whose number will be denot...
متن کاملAlgorithms for Rational Real Algebraic Curves
In this paper, we study fundamental properties of real curves, especially of rational real curves, and we derive several algorithms to decide the reality and rationality of curves in the complex plane. Furthermore, if the curve is real and rational, we determine a real parametrization. More precisely, we present a reality test algorithm for plane curves, and three different types of real parame...
متن کاملReal Parametrization of Algebraic Curves
There are various algorithms known for deciding the parametrizability (rationality) of a plane algebraic curve, and if the curve is rational, actually computing a parametrization. Optimality criteria such as low degrees in the parametrization or low degree field extensions are met by some parametrization algorithms. In this paper we investigate real curves. Given a parametrizable plane curve ov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2005
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2004.04.006